Black box scatter search for general classes of binary optimization problems
نویسندگان
چکیده
منابع مشابه
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represented as binary vectors and that may or may not include constraints. Binary problems arise in a variety of settings, including engineering design and statistical mechanics (e.g., the spin glass problem). A distinction is ...
متن کاملA black-box scatter search for optimization problems with integer variables
The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these problems as integer optimization problems. We assume that the decision variables are bounded and that there ...
متن کاملA Hybrid Genetic Scatter Search Algorithm for Solving Optimization Problems
The search methods that have been developed to investigate the optimum point of any optimization problem are suffering from some shortcomings especially that are complex and NP-hard problems. The progress that have been achieved in the filed of information technology leads to developing a new search methods called "intelligent search methods". This paper highlights hybrid genetic scatter search...
متن کاملHybrid binary GA-EDA algorithms for complex “black-box” optimization problems
Genetic Algorithms (GAs) have proved their efficiency solving many complex optimization problems. GAs can be also applied for “black-box” problems, because they realize the “blind” search and do not require any specific information about features of search space and objectives. It is clear that a GA uses the “Trial-and-Error” strategy to explorer search space, and collects some statistical info...
متن کاملClasses of Problems in the Black Box Scenario
The no-free-lunch theorems (NFLTs) do not consider explicitly the structure of problems. This led many researchers to argue that NFLTs cannot be applied to real-world problems (which arguably have structure). However, the notion of structure has never been defined formally and, hence, it is not clear in what way real world problems relate (or not) to the NFLTs and, more generally, to the black ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2010
ISSN: 0305-0548
DOI: 10.1016/j.cor.2010.01.013